1,071 research outputs found
Every planar graph with the Liouville property is amenable
We introduce a strengthening of the notion of transience for planar maps in
order to relax the standard condition of bounded degree appearing in various
results, in particular, the existence of Dirichlet harmonic functions proved by
Benjamini and Schramm. As a corollary we obtain that every planar non-amenable
graph admits Dirichlet harmonic functions
Twin inequality for fully contextual quantum correlations
Quantum mechanics exhibits a very peculiar form of contextuality. Identifying
and connecting the simplest scenarios in which more general theories can or
cannot be more contextual than quantum mechanics is a fundamental step in the
quest for the principle that singles out quantum contextuality. The former
scenario corresponds to the Klyachko-Can-Binicioglu-Shumovsky (KCBS)
inequality. Here we show that there is a simple tight inequality, twin to the
KCBS, for which quantum contextuality cannot be outperformed. In a sense, this
twin inequality is the simplest tool for recognizing fully contextual quantum
correlations.Comment: REVTeX4, 4 pages, 1 figur
Connectivity and tree structure in finite graphs
Considering systems of separations in a graph that separate every pair of a
given set of vertex sets that are themselves not separated by these
separations, we determine conditions under which such a separation system
contains a nested subsystem that still separates those sets and is invariant
under the automorphisms of the graph.
As an application, we show that the -blocks -- the maximal vertex sets
that cannot be separated by at most vertices -- of a graph live in
distinct parts of a suitable tree-decomposition of of adhesion at most ,
whose decomposition tree is invariant under the automorphisms of . This
extends recent work of Dunwoody and Kr\"on and, like theirs, generalizes a
similar theorem of Tutte for .
Under mild additional assumptions, which are necessary, our decompositions
can be combined into one overall tree-decomposition that distinguishes, for all
simultaneously, all the -blocks of a finite graph.Comment: 31 page
Finding flows in the one-way measurement model
The one-way measurement model is a framework for universal quantum
computation, in which algorithms are partially described by a graph G of
entanglement relations on a collection of qubits. A sufficient condition for an
algorithm to perform a unitary embedding between two Hilbert spaces is for the
graph G, together with input/output vertices I, O \subset V(G), to have a flow
in the sense introduced by Danos and Kashefi [quant-ph/0506062]. For the
special case of |I| = |O|, using a graph-theoretic characterization, I show
that such flows are unique when they exist. This leads to an efficient
algorithm for finding flows, by a reduction to solved problems in graph theory.Comment: 8 pages, 3 figures: somewhat condensed and updated version, to appear
in PR
Optimal path for a quantum teleportation protocol in entangled networks
Bellman's optimality principle has been of enormous importance in the
development of whole branches of applied mathematics, computer science, optimal
control theory, economics, decision making, and classical physics. Examples are
numerous: dynamic programming, Markov chains, stochastic dynamics, calculus of
variations, and the brachistochrone problem. Here we show that Bellman's
optimality principle is violated in a teleportation problem on a quantum
network. This implies that finding the optimal fidelity route for teleporting a
quantum state between two distant nodes on a quantum network with bi-partite
entanglement will be a tough problem and will require further investigation.Comment: 4 pages, 1 figure, RevTeX
Nordhaus-Gaddum for Treewidth
We prove that for every graph with vertices, the treewidth of
plus the treewidth of the complement of is at least . This bound is
tight
Partitioning 3-homogeneous latin bitrades
A latin bitrade is a pair of partial latin
squares which defines the difference between two arbitrary latin squares
and
of the same order. A 3-homogeneous bitrade has
three entries in each row, three entries in each column, and each symbol
appears three times in . Cavenagh (2006) showed that any
3-homogeneous bitrade may be partitioned into three transversals. In this paper
we provide an independent proof of Cavenagh's result using geometric methods.
In doing so we provide a framework for studying bitrades as tessellations of
spherical, euclidean or hyperbolic space.Comment: 13 pages, 11 figures, fixed the figures. Geometriae Dedicata,
Accepted: 13 February 2008, Published online: 5 March 200
Multi-party entanglement in graph states
Graph states are multi-particle entangled states that correspond to
mathematical graphs, where the vertices of the graph take the role of quantum
spin systems and edges represent Ising interactions. They are many-body spin
states of distributed quantum systems that play a significant role in quantum
error correction, multi-party quantum communication, and quantum computation
within the framework of the one-way quantum computer. We characterize and
quantify the genuine multi-particle entanglement of such graph states in terms
of the Schmidt measure, to which we provide upper and lower bounds in graph
theoretical terms. Several examples and classes of graphs will be discussed,
where these bounds coincide. These examples include trees, cluster states of
different dimension, graphs that occur in quantum error correction, such as the
concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier
transform in the one-way computer. We also present general transformation rules
for graphs when local Pauli measurements are applied, and give criteria for the
equivalence of two graphs up to local unitary transformations, employing the
stabilizer formalism. For graphs of up to seven vertices we provide complete
characterization modulo local unitary transformations and graph isomorphies.Comment: 22 pages, 15 figures, 2 tables, typos corrected (e.g. in measurement
rules), references added/update
Modeling Pauli measurements on graph states with nearest-neighbor classical communication
We propose a communication-assisted local-hidden-variable model that yields
the correct outcome for the measurement of any product of Pauli operators on an
arbitrary graph state, i.e., that yields the correct global correlation among
the individual measurements in the Pauli product. Within this model,
communication is restricted to a single round of message passing between
adjacent nodes of the graph. We show that any model sharing some general
properties with our own is incapable, for at least some graph states, of
reproducing the expected correlations among all subsets of the individual
measurements. The ability to reproduce all such correlations is found to depend
on both the communication distance and the symmetries of the communication
protocol.Comment: 9 pages, 2 figures. Version 2 significantly revised. Now includes a
site-invariant protocol for linear chains and a proof that no limited
communication protocol can correctly predict all quantum correlations for
ring
- …